TSTP Solution File: SEV067^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV067^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:41:14 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 42 ( 7 unt; 7 typ; 0 def)
% Number of atoms : 499 ( 148 equ; 0 cnn)
% Maximal formula atoms : 19 ( 14 avg)
% Number of connectives : 541 ( 81 ~; 76 |; 76 &; 276 @)
% ( 2 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 130 ( 0 ^ 122 !; 8 ?; 130 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cS: a > $o ).
thf(func_def_2,type,
cT: a > $o ).
thf(func_def_3,type,
cR: a > a > $o ).
thf(func_def_7,type,
sK0: a ).
thf(func_def_8,type,
sK1: a ).
thf(f52,plain,
$false,
inference(avatar_sat_refutation,[],[f39,f47,f51]) ).
thf(f51,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f50]) ).
thf(f50,plain,
( $false
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f49,f13]) ).
thf(f13,plain,
( ( cS @ sK1 )
= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ! [X0: a,X1: a] :
( ( X0 = X1 )
| ( ( cR @ X0 @ X1 )
!= $true )
| ( ( cR @ X1 @ X0 )
!= $true ) )
& ( ( cT @ sK0 )
= $true )
& ( ( cS @ sK0 )
!= $true )
& ! [X3: a,X4: a,X5: a] :
( ( ( cR @ X4 @ X5 )
= $true )
| ( ( cR @ X3 @ X5 )
!= $true )
| ( ( cR @ X4 @ X3 )
!= $true ) )
& ! [X6: a,X7: a] :
( ( ( cS @ X6 )
!= $true )
| ( ( cR @ X7 @ X6 )
!= $true )
| ( ( cS @ X7 )
= $true ) )
& ! [X8: a] :
( ( cR @ X8 @ X8 )
= $true )
& ! [X9: a,X10: a] :
( ( ( cT @ X10 )
!= $true )
| ( ( cR @ X9 @ X10 )
!= $true )
| ( ( cT @ X9 )
= $true ) )
& ( ( cT @ sK1 )
!= $true )
& ( ( cS @ sK1 )
= $true )
& ! [X12: a,X13: a] :
( ( ( cR @ X12 @ X13 )
= $true )
| ( ( cR @ X13 @ X12 )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f10,f9]) ).
thf(f9,plain,
( ? [X2: a] :
( ( ( cT @ X2 )
= $true )
& ( ( cS @ X2 )
!= $true ) )
=> ( ( ( cT @ sK0 )
= $true )
& ( ( cS @ sK0 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X11: a] :
( ( $true
!= ( cT @ X11 ) )
& ( ( cS @ X11 )
= $true ) )
=> ( ( ( cT @ sK1 )
!= $true )
& ( ( cS @ sK1 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ! [X0: a,X1: a] :
( ( X0 = X1 )
| ( ( cR @ X0 @ X1 )
!= $true )
| ( ( cR @ X1 @ X0 )
!= $true ) )
& ? [X2: a] :
( ( ( cT @ X2 )
= $true )
& ( ( cS @ X2 )
!= $true ) )
& ! [X3: a,X4: a,X5: a] :
( ( ( cR @ X4 @ X5 )
= $true )
| ( ( cR @ X3 @ X5 )
!= $true )
| ( ( cR @ X4 @ X3 )
!= $true ) )
& ! [X6: a,X7: a] :
( ( ( cS @ X6 )
!= $true )
| ( ( cR @ X7 @ X6 )
!= $true )
| ( ( cS @ X7 )
= $true ) )
& ! [X8: a] :
( ( cR @ X8 @ X8 )
= $true )
& ! [X9: a,X10: a] :
( ( ( cT @ X10 )
!= $true )
| ( ( cR @ X9 @ X10 )
!= $true )
| ( ( cT @ X9 )
= $true ) )
& ? [X11: a] :
( ( $true
!= ( cT @ X11 ) )
& ( ( cS @ X11 )
= $true ) )
& ! [X12: a,X13: a] :
( ( ( cR @ X12 @ X13 )
= $true )
| ( ( cR @ X13 @ X12 )
= $true ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ! [X8: a,X7: a] :
( ( X7 = X8 )
| ( ( cR @ X8 @ X7 )
!= $true )
| ( ( cR @ X7 @ X8 )
!= $true ) )
& ? [X13: a] :
( ( ( cT @ X13 )
= $true )
& ( ( cS @ X13 )
!= $true ) )
& ! [X11: a,X10: a,X9: a] :
( ( $true
= ( cR @ X10 @ X9 ) )
| ( ( cR @ X11 @ X9 )
!= $true )
| ( ( cR @ X10 @ X11 )
!= $true ) )
& ! [X0: a,X1: a] :
( ( ( cS @ X0 )
!= $true )
| ( ( cR @ X1 @ X0 )
!= $true )
| ( ( cS @ X1 )
= $true ) )
& ! [X2: a] :
( ( cR @ X2 @ X2 )
= $true )
& ! [X3: a,X4: a] :
( ( ( cT @ X4 )
!= $true )
| ( ( cR @ X3 @ X4 )
!= $true )
| ( ( cT @ X3 )
= $true ) )
& ? [X12: a] :
( ( ( cT @ X12 )
!= $true )
& ( ( cS @ X12 )
= $true ) )
& ! [X6: a,X5: a] :
( ( ( cR @ X6 @ X5 )
= $true )
| ( ( cR @ X5 @ X6 )
= $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( ? [X12: a] :
( ( ( cT @ X12 )
!= $true )
& ( ( cS @ X12 )
= $true ) )
& ? [X13: a] :
( ( ( cT @ X13 )
= $true )
& ( ( cS @ X13 )
!= $true ) )
& ! [X4: a,X3: a] :
( ( ( cT @ X3 )
= $true )
| ( ( cT @ X4 )
!= $true )
| ( ( cR @ X3 @ X4 )
!= $true ) )
& ! [X7: a,X8: a] :
( ( X7 = X8 )
| ( ( cR @ X7 @ X8 )
!= $true )
| ( ( cR @ X8 @ X7 )
!= $true ) )
& ! [X6: a,X5: a] :
( ( ( cR @ X6 @ X5 )
= $true )
| ( ( cR @ X5 @ X6 )
= $true ) )
& ! [X1: a,X0: a] :
( ( ( cS @ X1 )
= $true )
| ( ( cS @ X0 )
!= $true )
| ( ( cR @ X1 @ X0 )
!= $true ) )
& ! [X2: a] :
( ( cR @ X2 @ X2 )
= $true )
& ! [X10: a,X11: a,X9: a] :
( ( $true
= ( cR @ X10 @ X9 ) )
| ( ( cR @ X10 @ X11 )
!= $true )
| ( ( cR @ X11 @ X9 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X4: a,X3: a] :
( ( ( ( cT @ X4 )
= $true )
& ( ( cR @ X3 @ X4 )
= $true ) )
=> ( ( cT @ X3 )
= $true ) )
& ! [X7: a,X8: a] :
( ( ( ( cR @ X7 @ X8 )
= $true )
& ( ( cR @ X8 @ X7 )
= $true ) )
=> ( X7 = X8 ) )
& ! [X6: a,X5: a] :
( ( ( cR @ X6 @ X5 )
= $true )
| ( ( cR @ X5 @ X6 )
= $true ) )
& ! [X1: a,X0: a] :
( ( ( ( cS @ X0 )
= $true )
& ( ( cR @ X1 @ X0 )
= $true ) )
=> ( ( cS @ X1 )
= $true ) )
& ! [X2: a] :
( ( cR @ X2 @ X2 )
= $true )
& ! [X10: a,X11: a,X9: a] :
( ( ( ( cR @ X10 @ X11 )
= $true )
& ( ( cR @ X11 @ X9 )
= $true ) )
=> ( $true
= ( cR @ X10 @ X9 ) ) ) )
=> ( ! [X12: a] :
( ( ( cS @ X12 )
= $true )
=> ( ( cT @ X12 )
= $true ) )
| ! [X13: a] :
( ( ( cT @ X13 )
= $true )
=> ( ( cS @ X13 )
= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: a,X1: a] :
( ( ( cS @ X0 )
& ( cR @ X1 @ X0 ) )
=> ( cS @ X1 ) )
& ! [X2: a] : ( cR @ X2 @ X2 )
& ! [X3: a,X4: a] :
( ( ( cR @ X3 @ X4 )
& ( cT @ X4 ) )
=> ( cT @ X3 ) )
& ! [X5: a,X6: a] :
( ( cR @ X6 @ X5 )
| ( cR @ X5 @ X6 ) )
& ! [X7: a,X8: a] :
( ( ( cR @ X7 @ X8 )
& ( cR @ X8 @ X7 ) )
=> ( X7 = X8 ) )
& ! [X9: a,X10: a,X11: a] :
( ( ( cR @ X10 @ X11 )
& ( cR @ X11 @ X9 ) )
=> ( cR @ X10 @ X9 ) ) )
=> ( ! [X12: a] :
( ( cS @ X12 )
=> ( cT @ X12 ) )
| ! [X13: a] :
( ( cT @ X13 )
=> ( cS @ X13 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X4: a,X3: a] :
( ( ( cS @ X4 )
& ( cR @ X3 @ X4 ) )
=> ( cS @ X3 ) )
& ! [X0: a] : ( cR @ X0 @ X0 )
& ! [X3: a,X4: a] :
( ( ( cR @ X3 @ X4 )
& ( cT @ X4 ) )
=> ( cT @ X3 ) )
& ! [X1: a,X0: a] :
( ( cR @ X0 @ X1 )
| ( cR @ X1 @ X0 ) )
& ! [X0: a,X1: a] :
( ( ( cR @ X0 @ X1 )
& ( cR @ X1 @ X0 ) )
=> ( X0 = X1 ) )
& ! [X2: a,X0: a,X1: a] :
( ( ( cR @ X0 @ X1 )
& ( cR @ X1 @ X2 ) )
=> ( cR @ X0 @ X2 ) ) )
=> ( ! [X0: a] :
( ( cS @ X0 )
=> ( cT @ X0 ) )
| ! [X0: a] :
( ( cT @ X0 )
=> ( cS @ X0 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X4: a,X3: a] :
( ( ( cS @ X4 )
& ( cR @ X3 @ X4 ) )
=> ( cS @ X3 ) )
& ! [X0: a] : ( cR @ X0 @ X0 )
& ! [X3: a,X4: a] :
( ( ( cR @ X3 @ X4 )
& ( cT @ X4 ) )
=> ( cT @ X3 ) )
& ! [X1: a,X0: a] :
( ( cR @ X0 @ X1 )
| ( cR @ X1 @ X0 ) )
& ! [X0: a,X1: a] :
( ( ( cR @ X0 @ X1 )
& ( cR @ X1 @ X0 ) )
=> ( X0 = X1 ) )
& ! [X2: a,X0: a,X1: a] :
( ( ( cR @ X0 @ X1 )
& ( cR @ X1 @ X2 ) )
=> ( cR @ X0 @ X2 ) ) )
=> ( ! [X0: a] :
( ( cS @ X0 )
=> ( cT @ X0 ) )
| ! [X0: a] :
( ( cT @ X0 )
=> ( cS @ X0 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.CeVnEbFS5U/Vampire---4.8_29030',cTHM553_pme) ).
thf(f49,plain,
( ( ( cS @ sK1 )
!= $true )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f48]) ).
thf(f48,plain,
( ( ( cS @ sK1 )
!= $true )
| ( $true != $true )
| ~ spl2_1 ),
inference(superposition,[],[f14,f35]) ).
thf(f35,plain,
( ! [X1: a] :
( ( ( cT @ X1 )
= $true )
| ( ( cS @ X1 )
!= $true ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f34]) ).
thf(f34,plain,
( spl2_1
<=> ! [X1: a] :
( ( ( cT @ X1 )
= $true )
| ( ( cS @ X1 )
!= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f14,plain,
( ( cT @ sK1 )
!= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f47,plain,
~ spl2_2,
inference(avatar_contradiction_clause,[],[f46]) ).
thf(f46,plain,
( $false
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f45,f20]) ).
thf(f20,plain,
( ( cT @ sK0 )
= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f45,plain,
( ( ( cT @ sK0 )
!= $true )
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f44]) ).
thf(f44,plain,
( ( $true != $true )
| ( ( cT @ sK0 )
!= $true )
| ~ spl2_2 ),
inference(superposition,[],[f19,f38]) ).
thf(f38,plain,
( ! [X0: a] :
( ( ( cS @ X0 )
= $true )
| ( ( cT @ X0 )
!= $true ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f37]) ).
thf(f37,plain,
( spl2_2
<=> ! [X0: a] :
( ( ( cT @ X0 )
!= $true )
| ( ( cS @ X0 )
= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f19,plain,
( ( cS @ sK0 )
!= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f39,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f32,f37,f34]) ).
thf(f32,plain,
! [X0: a,X1: a] :
( ( ( cT @ X1 )
= $true )
| ( ( cT @ X0 )
!= $true )
| ( ( cS @ X0 )
= $true )
| ( ( cS @ X1 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f30]) ).
thf(f30,plain,
! [X0: a,X1: a] :
( ( ( cS @ X1 )
!= $true )
| ( ( cS @ X0 )
= $true )
| ( ( cT @ X1 )
= $true )
| ( $true != $true )
| ( ( cT @ X0 )
!= $true ) ),
inference(superposition,[],[f17,f26]) ).
thf(f26,plain,
! [X0: a,X1: a] :
( ( ( cR @ X1 @ X0 )
= $true )
| ( ( cT @ X1 )
!= $true )
| ( ( cT @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f25]) ).
thf(f25,plain,
! [X0: a,X1: a] :
( ( ( cR @ X1 @ X0 )
= $true )
| ( ( cT @ X1 )
!= $true )
| ( $true != $true )
| ( ( cT @ X0 )
= $true ) ),
inference(superposition,[],[f15,f12]) ).
thf(f12,plain,
! [X12: a,X13: a] :
( ( ( cR @ X13 @ X12 )
= $true )
| ( ( cR @ X12 @ X13 )
= $true ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f15,plain,
! [X10: a,X9: a] :
( ( ( cR @ X9 @ X10 )
!= $true )
| ( ( cT @ X9 )
= $true )
| ( ( cT @ X10 )
!= $true ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f17,plain,
! [X6: a,X7: a] :
( ( ( cR @ X7 @ X6 )
!= $true )
| ( ( cS @ X6 )
!= $true )
| ( ( cS @ X7 )
= $true ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEV067^5 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n026.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 12:26:06 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.CeVnEbFS5U/Vampire---4.8_29030
% 0.15/0.38 % (29282)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.38 % (29282)Instruction limit reached!
% 0.15/0.38 % (29282)------------------------------
% 0.15/0.38 % (29282)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (29282)Termination reason: Unknown
% 0.15/0.38 % (29282)Termination phase: shuffling
% 0.15/0.38
% 0.15/0.38 % (29282)Memory used [KB]: 895
% 0.15/0.38 % (29282)Time elapsed: 0.003 s
% 0.15/0.38 % (29282)Instructions burned: 2 (million)
% 0.15/0.38 % (29282)------------------------------
% 0.15/0.38 % (29282)------------------------------
% 0.15/0.38 % (29278)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.15/0.38 % (29279)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.15/0.38 % (29280)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.15/0.38 % (29281)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.38 % (29283)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.15/0.38 % (29284)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.15/0.38 % (29285)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.15/0.38 % (29281)Instruction limit reached!
% 0.15/0.38 % (29281)------------------------------
% 0.15/0.38 % (29281)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (29281)Termination reason: Unknown
% 0.15/0.38 % (29281)Termination phase: Preprocessing 1
% 0.15/0.38
% 0.15/0.38 % (29281)Memory used [KB]: 895
% 0.15/0.38 % (29281)Time elapsed: 0.003 s
% 0.15/0.38 % (29281)Instructions burned: 2 (million)
% 0.15/0.38 % (29281)------------------------------
% 0.15/0.38 % (29281)------------------------------
% 0.15/0.38 % (29279)Instruction limit reached!
% 0.15/0.38 % (29279)------------------------------
% 0.15/0.38 % (29279)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (29279)Termination reason: Unknown
% 0.15/0.38 % (29279)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (29279)Memory used [KB]: 5500
% 0.15/0.38 % (29279)Time elapsed: 0.005 s
% 0.15/0.38 % (29279)Instructions burned: 4 (million)
% 0.15/0.38 % (29279)------------------------------
% 0.15/0.38 % (29279)------------------------------
% 0.15/0.39 % (29285)Instruction limit reached!
% 0.15/0.39 % (29285)------------------------------
% 0.15/0.39 % (29285)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (29285)Termination reason: Unknown
% 0.15/0.39 % (29285)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (29285)Memory used [KB]: 5500
% 0.15/0.39 % (29285)Time elapsed: 0.005 s
% 0.15/0.39 % (29285)Instructions burned: 4 (million)
% 0.15/0.39 % (29285)------------------------------
% 0.15/0.39 % (29285)------------------------------
% 0.15/0.39 % (29278)First to succeed.
% 0.15/0.39 % (29283)Also succeeded, but the first one will report.
% 0.15/0.39 % (29280)Also succeeded, but the first one will report.
% 0.15/0.39 % (29278)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for Vampire---4
% 0.15/0.39 % SZS output start Proof for Vampire---4
% See solution above
% 0.15/0.39 % (29278)------------------------------
% 0.15/0.39 % (29278)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (29278)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (29278)Memory used [KB]: 5500
% 0.15/0.39 % (29278)Time elapsed: 0.008 s
% 0.15/0.39 % (29278)Instructions burned: 6 (million)
% 0.15/0.39 % (29278)------------------------------
% 0.15/0.39 % (29278)------------------------------
% 0.15/0.39 % (29277)Success in time 0.008 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------